How to Measure Path Length ?

نویسنده

  • Piet STROEVEN
چکیده

Path length measuring is a relevant engineering problem. Leonardo Da Vinci designed for the military appropriate equipment, the podometer, to do so. Modern equipment such as step meters and map meters are quite similar to Da Vinci‟s design, despite geometrical statistical stereological methods based on theorems of Cauchy and Buffon that were potentially available for a long period of time for doing a better job. The theorems have moreover been applied earlier for the engineering purposes indicated in this paper. Even Saltikov‟s reintroduction for quantitative image analysis purposes in 1945 was ignored. Gradually, the last half of a century, stereological methods became more popular in concrete technology. Nevertheless, the stereology-based global averaging operation required to make the step from materials technology to engineering properties is inherent to making errors, as the literature demonstrates. The methodological framework has been described in earlier papers by this author as to path length measurements in sections of cracked concrete and on X-ray images of steel fibre reinforced concrete (SFRC). By laying side by side in this paper the direct engineering approach (from Da Vinci to map meter) and the science (stereology)-based approaches, the profit in economy and reliability can nevertheless be stressed. Particularly the element of geometric averaging based on simple mathematical-statistical notions is highlighted, because the literature reflects still major violations to these scientific principles. Three-dimensional information in the indicated fields of materials engineering is also readily obtained, provided proper sampling is guaranteed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Appendices, Not for Publication

In this section, we provide basic definitions and interpretations for the different network characteristics that we consider. At the household level, we study: • Degree: the number of links that a household has. This is a measure of how well connected a node is in the graph. • Clustering coefficient: the fraction of a household’s neighbors that are themselves neighbors. This is a measure of how...

متن کامل

Genetics of Path Lengths in Brain Connectivity Networks: HARDI-Based Maps in 457 Adults

Brain connectivity analyses are increasingly popular for investigating organization. Many connectivity measures including path lengths are generally defined as the number of nodes traversed to connect a node in a graph to the others. Despite its name, path length is purely topological, and does not take into account the physical length of the connections. The distance of the trajectory may also...

متن کامل

Depth-based complexity traces of graphs

In this paper we aim to characterize graphs in terms of a structural measure of complexity. Our idea is to decompose a graph into layered substructures of increasing size, and then to measure the information content of these substructures. To locate dominant substructures within a graph, we commence by identifying a centroid vertex which has the minimum shortest path length variance to the rema...

متن کامل

The Comprehension of Garden-Path Structures by Iranian EFL Learners

The present study sought to investigate the comprehension of Garden-Path structures by Iranian EFL learners. 50 female students of Kharazmi English Language Institute in Karaj participated in this study. All of the participants were native speakers of Persian studying in Kharazmi English language institute in Karaj, Iran. They ranged from 18 to 30 in terms of age. The participants were administ...

متن کامل

Inspecting a Set of Strips Optimally

We consider a set of axis-parallel nonintersecting strips in the plane. An observer starts to the left of all strips and ends to the right, thus visiting all strips in the given order. A strip is inspected as long as the observer is inside the strip. How should the observer move to inspect all strips? We use the path length outside a strip as a quality measure which should be minimized. Therefo...

متن کامل

A new distance measure for comparing sequence profiles based on path lengths along an entropy surface

We describe a new distance measure for comparing DNA sequence profiles. For this measure, columns in a multiple alignment are treated as character frequency vectors (sum of the frequencies equal to one). The distance between two vectors is based on minimum path length along an entropy surface. Path length is estimated using a random graph generated on the entropy surface and Dijkstra's algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015